Faster Edge‐Path Bundling through Graph Spanners

Edge-Path bundling is a recent edge approach that does not incur ambiguities caused by disconnected edges together. Although the produces less ambiguous bundlings, it suffers from high computational cost. In this paper, we present new increases speed of algorithm without reducing quality bundling. First, demonstrate biconnected components can be processed separately in an graph changing result. Then, based on observing and exploiting strong relationship between spanners. worst case complexity same as original algorithm, conduct experiments to 5–256 times faster than depending dataset, which brings its practical running time more line with traditional algorithms.